All-Pay Auctions with Ties
نویسندگان
چکیده
We study the two-player, complete information all-pay auction in which a tie ensues if neither player outbids the other by more than a given amount. In the event of a tie, each player receives an identical fraction of the winning prize. Thus players engage in two margins of competition: losing versus tying, and tying versus winning. Two pertinent parameters are the margin required for victory and the value of tying relative to winning. We fully characterize the set of Nash equilibria for the entire parameter space. For much of the parameter space, there is a unique Nash equilibrium which is also symmetric. Equilibria typically involve randomizing over multiple disjoint intervals, so that in essence players randomize between attempting to tie and attempting to win. In equilibrium, expected bids and payoffs are non-monotonic in both the margin required for victory and the relative value of tying.
منابع مشابه
Revenue Maximizing Head Starts in Contests # 524
We characterize revenue maximizing head starts for all-pay auctions and lottery contests with many heterogeneous players. We show that under optimal head starts all-pay auctions revenue-dominate lottery contests for any degree of heterogeneity among players. Moreover, all-pay auctions with optimal head starts induce higher revenue than any multiplicatively biased all-pay auction or lottery cont...
متن کاملRevenue Maximizing Head Starts in Contests
We characterize revenue maximizing head starts for all-pay auctions and lottery contests with many heterogeneous players. We show that under optimal head starts all-pay auctions revenue-dominate lottery contests for any degree of heterogeneity among players. Moreover, all-pay auctions with optimal head starts induce higher revenue than any multiplicatively biased all-pay auction or lottery cont...
متن کاملExpected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints
We show that all-pay auctions dominate first-price sealed-bid auctions when bidders face budget constraints. This ranking is explained by the fact that budget constraints bind less frequently in the all-pay auctions, which leads to more aggressive bidding in that format.
متن کاملMunich Personal RePEc Archive Charity Auctions for the Happy Few
Recent literature has shown that all-pay auctions raise more money for charity than either winner-pay auctions or lotteries. We demonstrate that first-price and second-price winnerpay auctions have a better revenue performance than first-price and second-price all-pay auctions when bidders are sufficiently asymmetric. Lotteries can also provide higher revenue than all-pay auctions. To prove thi...
متن کاملBehavior in all-pay auctions with incomplete information
This paper analyzes the behavior of single-unit all-pay auctions within the independent private values environment in the laboratory. We study revenue, individual bidding behavior, and efficiency, in relation to theoretical benchmarks and to a similar study of winner-pay first-price sealed-bid auctions. We conclude that the all-pay auction yields significantly higher revenue than both the riskn...
متن کاملA comparison of multiple-unit all-pay and winner-pay auctions under incomplete information
A Comparison of Multiple-Unit All-Pay and Winner-Pay Auctions under Incomplete Information by Yasar Barut, Dan Kovenock, and Charles Noussair This paper examines the properties of independent-private-value all-pay and winner-pay auctions when there are multiple units sold. We study bidding behavior, efficiency and revenue in a set of nine experimental sessions, each with six bidders. All-pay au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017